Insecure Context Switching: Inoculating Regular Expressions for Survivability

نویسندگان

  • Will Drewry
  • Tavis Ormandy
چکیده

For most computer end–users, web browsers and Internet services act as the providers and protectors of their personal information, from bank accounts to personal correspondence. These systems are critical to users’ continued lifestyles but often show no evidence of survivability [43], or robustness against present and future attacks. Software defects, considered the largest risk to survivability [43], are quite prevalent in consumer products and Web service software components [9]. Recent widespread security issues [17] [16] serve to emphasize this fact and show a lack investment in survivability engineering practices [19] [20] [49] [52] that may have mitigated the risk. Common software components that comprise industry software, commercial or free, were authored and deployed with functional isolation in mind. Despite original intent, many of these components are migrating in to Internet–connected systems. The context switch from functional isolation to extreme connectivity changes the threat environment of these components dramatically [7] [52]. Most software that has undergone this sort of insecure context switch has received very little security attention. This paper briefly surveys recent examples of these sorts of context switches. In particular, we focus on the survivability and inoculation [29] of regular expression engine implementations in connected environments. Through the course of this research, a number of critical vulnerabilities were uncovered that traverse operating systems and applications including Adobe Flash, Apple Safari, Perl, GnuPG, and ICU.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Survivability and reliability of a composite-star transport network with disconnected core switches

This paper deals with the design and dimensioning of a novel survivable optical network structure, called Petaweb, that can reach a total capacity of several Pb/s (1015 bit/s). The Petaweb has a composite-star architecture that allows two-hop connections between edge nodes through disconnected core nodes. Prior studies of the same authors have tackled the optimization of a Petaweb network archi...

متن کامل

Optimal Coding Subgraph Selection under Survivability Constraint

Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...

متن کامل

Survivability From a Sow’s Ear: The Retrofit Security Requirement

This paper considers the survivability requirement for production operating systems that underlie typical information systems. Since economic incentives give competitive advantages to imperfect and therefore insecure software, it seems inevitable to consider retrofitting some form of security to existing systems. This approach has long been anathema in the security community. We outline the pra...

متن کامل

Enumerating Regular Expressions and Their Languages

In this chapter we discuss the problem of enumerating distinct regular expressions bysize and the regular languages they represent. We discuss various notions of the size of a regularexpression that appear in the literature and their advantages and disadvantages. We consider aformal definition of regular expressions using a context-free grammar.We then show how to enumerate stri...

متن کامل

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions

The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008